Groups with boundedly many commutators of maximal order

نویسندگان

چکیده

By a result of Cocke and Venkataraman we know that if G is group with at most m elements maximal order, then | -bounded. In this paper consider the following related setting. Suppose commutators whose order among all commutators. What can say about structure ?

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On solubility of groups with finitely many centralizers

For any group G, let C(G) denote the set of centralizers of G.We say that a group G has n centralizers (G is a Cn-group) if |C(G)| = n.In this note, we prove that every finite Cn-group with n ≤ 21 is soluble andthis estimate is sharp. Moreover, we prove that every finite Cn-group with|G| < 30n+1519 is non-nilpotent soluble. This result gives a partial answer to aconjecture raised by A. Ashrafi in ...

متن کامل

Appendix: Boundedly Generated Groups with Pseudocharacter(s)

The aim of this appendix is to construct concrete groups which simultaneously: (1) are boundedly generated; (2) have Kazhdan’s property (T); (3) have a one-dimensional space of pseudocharacters. By (3), such groups don’t have property (QFA), whilst they have property (FA) by (2); moreover the quasimorphisms in (3) cannot be bushy in the sense of [9]. Property (3) has its own interest, as all pr...

متن کامل

On Commutators in Groups

Commutators originated over 100 years ago as a by-product of computing group characters of nonabelian groups. They are now an established and immensely useful tool in all of group theory. Commutators became objects of interest in their own right soon after their introduction. In particular, the phenomenon that the set of commutators does not necessarily form a subgroup has been well documented ...

متن کامل

Boundedly Simple Groups of Automorphisms of Trees

A group is boundedly simple if for some constant N , every nontrivial conjugacy class generates the whole group in N steps (bounded simplicity implies simplicity). For a large class of trees, Tits proved simplicity of automorphism groups generated by stabilisers of edges. We determine the subclass of trees for which such groups are boundedly simple. This is the class of subdivisions of bi-regul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2021

ISSN: ['1090-266X', '0021-8693']

DOI: https://doi.org/10.1016/j.jalgebra.2020.09.011